Characterization of 2-minimally Nonouterplanar Join Graphs
نویسندگان
چکیده
In this paper, we present characterizations of pairs of graphs whose join graphs are 2-minimally nonouterplanar. In addition, we present a characterization of pairs of graphs whose join graphs are 2-minimally nonouterplanar in terms of forbidden subgraphs.
منابع مشابه
Forbidden Subgraphs for Planar Blict and Blitact Graphs
Many graphs which are encountered in the study of graph theory are characterized by a type of configuration or subgraphs they possess. However, there are occasions when such graphs are more easily defined or described by the kind of subgraphs they are not permitted to contain. Such subgraphs are called forbidden subgraphs. In this paper, we present characterizations of graphs whose blict and bl...
متن کاملCharacterizations of planar plick graphs
In this paper we present characterizations of graphs whose plick graphs are planar, outerplanar and minimally nonouterplanar.
متن کاملThe automorphism group of the reduced complete-empty $X-$join of graphs
Suppose $X$ is a simple graph. The $X-$join $Gamma$ of a set ofcomplete or empty graphs ${X_x }_{x in V(X)}$ is a simple graph with the following vertex and edge sets:begin{eqnarray*}V(Gamma) &=& {(x,y) | x in V(X) & y inV(X_x) },\ E(Gamma) &=& {(x,y)(x^prime,y^prime) | xx^prime in E(X) or else x = x^prime & yy^prime in E(X_x)}.end{eqnarray*}The $X-$join graph $Gamma$ is said to be re...
متن کاملSIGNED ROMAN DOMINATION NUMBER AND JOIN OF GRAPHS
In this paper we study the signed Roman dominationnumber of the join of graphs. Specially, we determine it for thejoin of cycles, wheels, fans and friendship graphs.
متن کاملDecomposition characterizations of classes of 2-connected graphs
By applying the Tutte decomposition of 2{connected graphs into 3{block trees we provide unique structural characterizations of several classes of 2{connected graphs, including minimally 2{connected graphs, minimally 2{edge{connected graphs, critically 2{connected graphs, critically 2{edge{connected graphs, 3{edge{connected graphs, 2{connected cubic graphs and 3{connected cubic graphs. We also g...
متن کامل